On Smoothest Interpolants *
نویسنده
چکیده
This paper is concerned with the problem of characterizing those functions of minimum LP-norm on their nth derivative, <=p=<, that sequentially take on the given values (ei). For p = the unique minimizing function is characterized. For p < fairly explicit necessary conditions are given.
منابع مشابه
Numerical integration using spline quasi-interpolants
In this paper, quadratic rules for obtaining approximate solution of definite integrals as well as single and double integrals using spline quasi-interpolants will be illustrated. The method is applied to a few test examples to illustrate the accuracy and the implementation of the method.
متن کاملSmooth Interpolation of Zero Curves
Smoothness is a desirable characteristic of interpolated zero curves; not only is it intuitively appealing, but there is some evidence that it provides more accurate pricing of securities. This paper outlines the mathematics necessary to understand the smooth interpolation of zero curves, and describes two useful methods: cubic-spline interpolation—which guarantees the smoothest interpolation o...
متن کاملORTHOGONAL ZERO INTERPOLANTS AND APPLICATIONS
Orthogonal zero interpolants (OZI) are polynomials which interpolate the “zero-function” at a finite number of pre-assigned nodes and satisfy orthogonality condition. OZI’s can be constructed by the 3-term recurrence relation. These interpolants are found useful in the solution of constrained approximation problems and in the structure of Gauss-type quadrature rules. We present some theoretical...
متن کاملNear minimally normed spline quasi-interpolants on uniform partitions
Spline quasi-interpolants are local approximating operators for functions or discrete data. We consider the construction of discrete and integral spline quasi-interpolants on uniform partitions of the real line having small infinite norms. We call them near minimally normed quasi-interpolants: they are exact on polynomial spaces and minimize a simple upper bound of their infinite norms. We give...
متن کاملLeveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quality of approximations and consequently the performance of the model checkers. Recently, it was observed that for the same resolution proof a complete lattice of interpolants ordered by strength can be derived. Most stat...
متن کامل